[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Computes the intersection of this bag with another bag. The intersection of two bags
is all items that appear in both of the bags. If an item appears X times in one bag,
and Y times in the other bag, the sum contains the item Minimum(X,Y) times. This bag receives
the intersection of the two bags, the other bag is unchanged.
Namespace: Wintellect.PowerCollections
Assembly:
PowerCollections (in PowerCollections.dll)
Syntax
| C# |
|---|
public void IntersectionWith( Bag<T> otherBag ) |
| Visual Basic (Declaration) |
|---|
Public Sub IntersectionWith ( _ otherBag As Bag(Of T) _ ) |
| Visual C++ |
|---|
public: void IntersectionWith ( Bag<T>^ otherBag ) |
Parameters
- otherBag
- Bag<(Of <T>)>
Bag to intersection with.
Remarks
When equal items appear in both bags, the intersection will include an arbitrary choice of one of the two equal items.
The intersection of two bags is computed in time O(N), where N is the size of the smaller bag.
Exceptions
| Exception | Condition |
|---|---|
| System..::InvalidOperationException | This bag and otherBag don't use the same method for comparing items. |
See Also
Bag<(Of <T>)> Class
Wintellect.PowerCollections Namespace
Send comments about this topic to Microsoft.